A Revision-Theoretic Analysis of the Arithmetical Hierarchy

نویسنده

  • Gian Aldo Antonelli
چکیده

In this paper we apply the idea of Revision Rules, originally developed within the framework of the theory of truth and later extended to a general mode of definition, to the analysis of the arithmetical hierarchy. This is also intended as an example of how ideas and tools from philosophical logic can provide a different perspective on mathematically more “respectable” entities. Revision Rules were first introduced by A. Gupta and N. Belnap as tools in the theory of truth, and they have been further developed to provide the foundations for a general theory of (possibly circular) definitions. Revision Rules are non-monotonic inductive operators that are iterated into the transfinite beginning with some given “bootstrapper” or “initial guess.” Since their iteration need not give rise to an increasing sequence, Revision Rules require a particular kind of operation of “passage to the limit,” which is a variation on the idea of the inferior limit of a sequence. We then define a sequence of sets of strictly increasing arithmetical complexity, and provide a representation of these sets by means of an operator G(x, φ) whose “revision” is carried out over ω beginning with any total function satisfying certain relatively simple conditions. Even this relatively simple constraint is later lifted, in a theorem whose proof is due to Anil Gupta. In this paper we apply the idea of Revision Rules, originally developed within the framework of the theory of truth and later extended to a general mode of definition, to the analysis of the arithmetical hierarchy. This is also intended as an example of how ideas and tools from philosophical logic can provide a different perspective on mathematically more “respectable” entities. Revision Rules were first introduced by A. Gupta [2] and N. Belnap [1] and, independently, Herzberger [4] as tools in the theory of truth, and have found their most detailed * Current address: Yale University, Department of Philosophy, P.O. Box 208306, New Haven, CT 06520

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the arithmetical rank of a special class of minimal varieties

We study the arithmetical ranks and the cohomological dimensions of an infinite class of Cohen-Macaulay varieties of minimal degree. Among these we find, on the one hand, infinitely many set-theoretic complete intersections, on the other hand examples where the arithmetical rank is arbitrarily greater than the codimension.

متن کامل

Real Hypercomputation and Degrees of Discontinuity

By the sometimes so-called Main Theorem of Recursive Analysis, every computable real function is necessarily continuous. Weihrauch and Zheng (TCS 2000), Brattka (MLQ2005), and Ziegler (ToCS 2006) have considered different relaxed notions of computability to cover also discontinuous functions. The present work compares and unifies these approaches. This is based on the concept of the jump of a r...

متن کامل

Real Analytic Machines and Degrees

We study and compare in degree-theoretic ways (iterated Halting oracles analogous to Kleene’s arithmetical hierarchy, and the Borel hierarchy of descriptive set theory) the capabilities and limitations of three models of real computation: BSS machines (aka real-RAM) and strongly/weakly analytic machines as introduced by Hotz et al. (1995).

متن کامل

Mass problems and measure-theoretic regularity

A well known fact is that every Lebesgue measurable set is regular, i.e., it includes an Fσ set of the same measure. We analyze this fact from a metamathematical or foundational standpoint. We study a family of Muchnik degrees corresponding to measure-theoretic regularity at all levels of the effective Borel hierarchy. We prove some new results concerning Nies’s notion of LR-reducibility. We bu...

متن کامل

A Recursion-theoretic Characterization of the Ramified Analytical Hierarchy

Introduction. According to a classical theorem of Post, the arithmetical sets may be obtained by the following construction : Step 0: "take" all the r.e. sets. Step n+1 : "add" all sets which are r.e. in sets "taken" at a previous stage. Moreover, this construction is intimately related to the Kleene arithmetical hierarchy, defined in terms of the number and quality of alternating numberquantif...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Notre Dame Journal of Formal Logic

دوره 35  شماره 

صفحات  -

تاریخ انتشار 1994